Search results for "Linear bottleneck assignment problem"
showing 1 items of 1 documents
The minimal cost maximum matching of a graph (supplementary remarks)
1971
In addition to the preceding paper, it will be shown that (1) the matching problem is closely related to the linear assignment problem and how (2) this property can be taken advantage of for solving the matching problem.